Random polymers on the complete graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Random-cluster Model on the Complete Graph

Béla Bollobás, Geoffrey Grimmett, Svante Janson Abstract. The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph on n vertices, then the associated processes are called ‘mean-field’. In this study of the mean-field random-cluster with parameters p = λ/n and q, we...

متن کامل

On the Complete Convergence ofWeighted Sums for Dependent Random Variables

We study the limiting behavior of weighted sums for negatively associated (NA) random variables. We extend results in Wu (1999) and a theorem in Chow and Lai (1973) for NA random variables.

متن کامل

Two particles ’ repelling random walks on the complete graph

We consider two particles’ repelling random walks on complete graphs. In this model, each particle has higher probability to visit the vertices which have been seldom visited by the other one. By a dynamical approach we prove that the two particles’ occupation measure asymptotically has small joint support almost surely if the repulsion is strong enough.

متن کامل

Nim On The Complete Graph

The two-player game of Nim on graphs is played on a regular graph with positively weighted edges by moving alternately from a fixed starting vertex to an adjacent vertex, decreasing the weight of the incident edge to a strictly smaller non-negative integer. The game ends when a player is unable to move since all edges incident with the vertex from which the player is to move have weight zero. I...

متن کامل

Measures on the random graph

We consider the problem of characterizing the finitely additive probability measures on the definable subsets of the random graph which are invariant under the action of the automorphism group of this graph. We show that such measures are all integrals of Bernoulli measures (which arise from the coin-flipping model of the construction of the random graph). We also discuss generalizations to oth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2019

ISSN: 1350-7265

DOI: 10.3150/17-bej1002